The Dunkl–Williams constant, convexity, smoothness and normal structure
نویسندگان
چکیده
منابع مشابه
the underlying structure of language proficiency and the proficiency level
هدف از انجام این تخقیق بررسی رابطه احتمالی بین سطح مهارت زبان خارجی (foreign language proficiency) و ساختار مهارت زبان خارجی بود. تعداد 314 زبان آموز مونث و مذکر که عمدتا دانشجویان رشته های زبان انگلیسی در سطوح کارشناسی و کارشناسی ارشد بودند در این تحقیق شرکت کردند. از لحاظ سطح مهارت زبان خارجی شرکت کنندگان بسیار با هم متفاوت بودند، (75 نفر سطح پیشرفته، 113 نفر سطح متوسط، 126 سطح مقدماتی). کلا ...
15 صفحه اولGraduated Non-Convexity by Smoothness Focusing
Noise-corrupted signals and images can be reconstructed by regularization. If discontinuities must be preserved in the reconstruction, a non-convex solution space is implied. The solution of minimum energy can be approximated by the Graduated Non-Convexity (GNC) algorithm. The GNC approximates the non-convex solution space by a convex solution space, and varies the solution space slowly towards...
متن کاملNormal forms on contracting foliations: smoothness and homogeneous structure
In this paper we consider a diffeomorphism f of a compact manifold M which contracts an invariant foliation W with smooth leaves. If the differential of f on TW has narrow band spectrum, there exist coordinates Hx : Wx → TxW in which f |W has polynomial form. We present a modified approach that allows us to construct mapsHx that depend smoothly on x along the leaves of W . Moreover, we show tha...
متن کاملNormal Structure and Modulus of U -convexity in Banach Spaces
Let X be a normed linear space, and let S(X) = fx 2 X : kxk = 1g be the unit sphere of X. Brodskii and Milman 1] introduced the following geometric concept: Deenition 1. A bounded, convex subset K of a Banach space X is said to have normal structure if every convex subset H of K that contains more than one point contains a point x 0 2 H, such that supfkx 0 ? yk : y 2 Hg < d(H); where d(H) = sup...
متن کاملRSG: Beating Subgradient Method without Smoothness and Strong Convexity
In this paper, we study the efficiency of a Restarted SubGradient (RSG) method that periodically restarts the standard subgradient method (SG). We show that, when applied to a broad class of convex optimization problems, RSG method can find an ǫ-optimal solution with a low complexity than SG method. In particular, we first show that RSG can reduce the dependence of SG’s iteration complexity on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2008
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2007.11.045